Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
671	Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30 Add to Reading List Source URL: www3.math.tu-berlin.de Language: English Complexity classes Matroid theory NP-complete problems Dimension Matroid Cubic graph Induced path NP-hard Time complexity Theoretical computer science Graph theory Mathematics
672	Program for MDS Status Workshop, 2012. Friday[removed]:30 – 17:05 Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces Max Klimm Add to Reading List Source URL: www3.math.tu-berlin.de Language: English NP-complete problems Matroid theory Graph operations Tree decomposition Matroid Minor Vertex cover Graph Dominating set Graph theory Mathematics Theoretical computer science
673	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-12 06:04:13 NP-complete problems Combinatorial optimization Graph coloring Probabilistic complexity theory Algorithms Semidefinite programming Randomized algorithm Approximation algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics
674	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 NP-complete problems Steiner tree problem Graph theory Theoretical computer science Mathematics
675	Chapter 6: Randomized Rounding of Semidefinite Programs (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-12-12 06:05:34 Operations research NP-complete problems Combinatorial optimization Mathematical optimization Graph coloring Semidefinite programming Approximation algorithm Randomized algorithm Randomized rounding Theoretical computer science Mathematics Applied mathematics
676	Optimal Cuts and Partitions in Tree Metrics in Polynomial Time Marek Karpinski∗ Andrzej Lingas† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-12-14 09:54:30 Combinatorial optimization NP-complete problems Network theory Dynamic programming Equations Systems engineering Tree decomposition Graph Shortest path problem Graph theory Mathematics Theoretical computer science
677	Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication Grey Ballard James Demmel Olga Holtz Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2012-09-10 19:42:10 NP-complete problems Combinatorial optimization Matching Tree Matrix Directed acyclic graph Graph coloring Expander code Graph theory Mathematics Theoretical computer science
678	New Inapproximability Bounds for TSP Marek Karpinski∗ Michael Lampis† Richard Schmied‡ Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-26 06:58:50 Combinatorial optimization NP-complete problems Operations research Travelling salesman problem Matching Graph Cut Connectivity Eulerian path Graph theory Mathematics Theoretical computer science
679	November 8, S0129054110007635[removed]:45 WSPC/INSTRUCTION Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2010-12-13 06:54:39 NP-complete problems Matching Analysis of algorithms Graph coloring Combinatorial optimization Independent set Hypergraph Randomized algorithm Induced path Graph theory Theoretical computer science Mathematics
680	A BRANCH-AND-PRICE APPROACH FOR GRAPH MULTI-COLORING Anuj Mehrotra Department of Management Science School of Business Administration University of Miami Add to Reading List Source URL: mat.gsia.cmu.edu Language: English - Date: 2008-03-27 11:19:03 Graph coloring NP-complete problems Linear programming relaxation Independent set Linear programming Bipartite graph Fractional coloring Edge coloring Graph theory Mathematics Theoretical computer science

UPDATE